Chordal Digraphs
نویسندگان
چکیده
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed graphs. Several structural properties of chordal graphs that are crucial for algorithmic applications carry over to the directed setting, including notions like simplicial vertices, perfect elimination orderings, and characterisation by forbidden subgraphs resembling chordless cycles. Moreover, just as chordal graphs are related to treewidth, the chordal digraphs will be related to Kelly-width.
منابع مشابه
Pushing vertices in digraphs without long induced cycles
Given a digraph D and a subset X of vertices of D, pushing X in D means reversing the orientation of all arcs with exactly one end in X. It is known that the problem of deciding whether a given digraph can be made acyclic using the push operation is NP-complete for general digraphs, and polynomial time solvable for multipartite tournaments. Here, we continue the study of deciding whether a digr...
متن کاملElimination Ordering Characterizations of Digraphs with Interval and Chordal Competition Graphs
Competition graphs have appeared in a variety of applications from food webs to communication networks to energy models. The competition graph, C (D), of a digraph D has the same vertex set as D and (x; y) is an edge in C (D) if and only if there is a vertex z such that (x; z) and (y; z) are arcs in D. It has been observed that most actual food webs have interval competition graphs. Subsequent ...
متن کاملList Partitions of Chordal Graphs
In an earlier paper we gave efficient algorithms for partitioning chordal graphs into k independent sets and l cliques. This is a natural generalization of the problem of recognizing split graphs, and is NPcomplete for graphs in general, unless k ≤ 2 and l ≤ 2. (Split graphs have k = l = 1.) In this paper we expand our focus and consider generalM -partitions, also known as trigraph homomorphism...
متن کاملPerfect graphs with polynomially computable kernels
In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a perfect graph. However, an open question is the complexity status of the computation of a kernel in such a digraph. Our main contribution is to prove new polyn...
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 463 شماره
صفحات -
تاریخ انتشار 2009